A numerically inexpensive globalization strategy of sequential quadratic programming
methods (SQP-methods) for control of the instationary Navier Stokes equations is investigated.
Based on the proper functional analytic setting a convergence analysis for the globalized method
is given. It is argued that the a priori formidable SQP-step can be decomposed into linear primal
and linear adjoint systems, which is amenable for existing CFL-software. A report on a numerical
test demonstrates the feasibility of the approach.